A Binary Additive Problem of Erd } Os and the Order
نویسندگان
چکیده
We show that the problem of representing every odd positive integer as the sum of a squarefree number and a power of 2, is strongly related to the problem of showing that p 2 divides 2 p?1 ? 1 for \few" primes p.
منابع مشابه
J ul 2 00 9 Preprint , arXiv : 0810 . 0467 LINEAR EXTENSION OF THE ERDŐS - HEILBRONN CONJECTURE
The famous Erd˝ os-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erd˝ os-Heilbronn conjecture): For any finite subset A of a field F and nonzero elements a where p(F) is the additive order of the multiplicative identity of F , and δ ∈ {0, 1} takes the value ...
متن کامل1 9 A ug 2 00 9 Preprint , arXiv : 0810 . 0467 LINEAR EXTENSION OF THE ERDŐS - HEILBRONN CONJECTURE
The famous Erd˝ os-Heilbronn conjecture plays an important role in the development of additive combinatorics. In 2007 Z. W. Sun made the following further conjecture (which is the linear extension of the Erd˝ os-Heilbronn conjecture): For any finite subset A of a field F and nonzero elements a where p(F) is the additive order of the multiplicative identity of F , and δ ∈ {0, 1} takes the value ...
متن کاملRational Erd} Os Numbers
The concept of Erd} os number is well known among mathematicians and somewhat known more generally (see, for example, de Castro & Grossman, 1999] or the web site Paul Erd} os, who died in late 1996, was a mathematician who was author or coauthor|most often the latter|of nearly 1500 papers and had nearly 500 coauthors. By deenition, Erd} os had Erd} os number zero, his collaborators had Erd} os ...
متن کاملUpper Bounds on the Covering Number of Galois-Planes with Small Order
Our paper deals with a problem of P. Erd} os' related to the covering number of blocking sets of nite projective planes. An integer linear programming (ILP) formulation of Erd} os' problem is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of nite projective planes. Since the ILP problem is NP-hard and may involve...
متن کاملAn Erd os-Gallai Theorem For Matroids
Erd os and Gallai showed that for any simple graph with n vertices and circumference c it holds that |E(G)| ≤ 2 (n−1)c.We extend this theorem to simple binary matroids having no F7-minor by showing that for such a matroid M with circumference c(M)≥ 3 it holds that |E(M)| ≤ 1 2 r(M)c(M). Mathematics Subject Classi cation (2000). Primary 05D15; Secondary 05B35.
متن کامل